Coloring complexes and combinatorial Hopf monoids
نویسندگان
چکیده
We generalize the notion of a coloring complex graph to linearized combinatorial Hopf monoids. determine when monoid has such construction, and discover some inequalities that are satisfied by quasisymmetric function invariants associated monoid. show collection all complexes forms monoid, which is terminal object in category monoids with convex characters. also study several examples
منابع مشابه
Combinatorial Hopf Algebras of Simplicial Complexes
We consider a Hopf algebra of simplicial complexes and provide a cancellation-free formula for its antipode. We then obtain a family of combinatorial Hopf algebras by defining a family of characters on this Hopf algebra. The characters of these combinatorial Hopf algebras give rise to symmetric functions that encode information about colorings of simplicial complexes and their f -vectors. We al...
متن کاملSupercharacters and Hopf Monoids
Before the workshop, we suggested that the following reading list [1, 2, 3, 4, 5, 6] would be a good refreshment for all of us. At the start of the workshop, we identified the following problems that were worth considering given the recent progress in the area. 1. Higman’s conjecture. 2. Compute the antipode of the monoid scf(U) in the supercharacter basis. 3. Explicitly describe the multiplica...
متن کاملHopf Monoids in Varieties
We show that entropic varieties provide the canonical setting for a generaliziation of Hopf algebra theory. In particular we show that all naturally occurring functors in this context have the expected adjoints, when generalized to this level. In particular, universal measuring comonoids exist over every entropic variety, as do generalized group algebras, and these carry a canonical Hopf struct...
متن کاملCombinatorial operads from monoids
We introduce a functorial construction which, from a monoid, produces a setoperad. We obtain new (symmetric or not) operads as suboperads or quotients of the operads obtained from usual monoids such as the additive and multiplicative monoids of integers and cyclic monoids. They involve various familiar combinatorial objects: endofunctions, parking functions, packed words, permutations, planar r...
متن کاملLagrange’s Theorem for Hopf Monoids in Species
Following Radford’s proof of Lagrange’s theorem for pointed Hopf algebras, we prove Lagrange’s theorem for Hopf monoids in the category of connected species. As a corollary, we obtain necessary conditions for a given subspecies k of a Hopf monoid h to be a Hopf submonoid: the quotient of any one of the generating series of h by the corresponding generating series of k must have nonnegative coef...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2023
ISSN: ['0097-3165', '1096-0899']
DOI: https://doi.org/10.1016/j.jcta.2022.105698